Aerial Cooperative SLAM for Ground Mobile Robot Path Planning

نویسندگان

چکیده

The trajectory planning for ground mobile robots operating in unknown environments can be a difficult task. In many cases, the sensors used detecting obstacles only provide information about immediate surroundings, making it to generate an efficient long-term path. For instance, robot easily choose move along free path that, eventually, will have dead end. This research is intended develop cooperative scheme of visual-based aerial simultaneous localization and mapping (SLAM) that generating safe robot. general idea take advantage high-altitude point view obtain spatial wide area surroundings this case, could seen as having zenithal picture labyrinth solve robot’s More specifically, system map from images taken by team equipped with onboard cameras, means SLAM method. At same time, While moves, its refinine and, thus, avoid were not detected images.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cooperative Multi-Robot Path Planning

In risky applications it is advantageous to use multiple robots in order to improve performances. In a research or patrol scenario robots have to move cooperatively in order to avoid collisions and to improve performance. In this paper we describe the implementation of two variations of a cooperative planning algorithm: Cooperative A* and Cooperative Voronoi A*. The task is decoupled into a ser...

متن کامل

Path Following and Velocity Optimizing for an Omnidirectional Mobile Robot

In this paper, the path following controller of an omnidirectional mobile robot (OMR) has been extended in such a way that the forward velocity has been optimized and the actuator velocity constraints have been taken into account. Both have been attained through the proposed model predictive control (MPC) framework. The forward velocity has been included into the objective function, while the a...

متن کامل

Path Planning Algorithm for Mobile Robot

The paper presents an algorithm for planning the path of a mobile robot in a labyrinth. The algorithm uses an image, obtained by a camera. The algorithm processes the image to convert it into a matrix, presenting the labyrinth with obstacles and walls. Afterwards the algorithm finds the shortest path to a final target in the labyrinth. As opposed to the classical Dijkstra’s algorithm, the prese...

متن کامل

Path Relaxation: Path Planning for a Mobile Robot

Path Relaxation is a method of planning safe paths around obstacles for mobile robots. It works in two steps: a global grid starch that finds a rough path, followed by a local relaxation step that adjusts each node on the path to lower the overall path cost. The representation used by Path Relaxation allows an explicit tradeoff among length of path, clearance away from obstacles, and distance t...

متن کامل

Mobile Robot Path Planning Using Genetic Algorithms

Genetic Algorithms (GAs) have demonstrated to be effective procedures for solving multicriterion optimization problems. These algorithms mimic models of natural evolution and have the ability to adaptively search large spaces in near-optimal ways. One direct application of this intelligent technique is in the area of evolutionary robotics, where GAs are typically used for designing behavioral c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Engineering proceedings

سال: 2021

ISSN: ['2673-4591']

DOI: https://doi.org/10.3390/i3s2021dresden-10164